BDD Representation for Incompletely Specified Multiple-Output Logic Functions and Its Applications to the Design of LUT Cascades

نویسندگان

  • Munehiro Matsuura
  • Tsutomu Sasao
چکیده

A multiple-output function can be represented by a binary decision diagram for characteristic function (BDD for CF). This paper presents a method to represent multiple-output incompletely specified functions using BDD for CFs. An algorithm to reduce the widths of BDD for CFs is presented. This method is useful for decomposition of incompletely specified multiple-output functions. Experimental results for radix converters, adders, a multiplier, and lists of English words show that this method is useful for the synthesis of LUT cascades. An implementation of English words list by LUT cascades and an auxiliary memory is also shown. key words: incompletely specified function, characteristic function, binary decision diagram, functional decomposition, LUT cascade

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Logic Synthesis of LUT Cascades with Limited Rails

Programmable LUT cascades are used to evaluate multi-output Boolean functions. This paper shows several representations of multi-output functions and introduces a new decomposition algorithm applicable to these representations. The algorithm produces LUT cascades with the limited number of rails, which leads to significantly faster circuits and applicability to large designs. The experiment sho...

متن کامل

Efficient Evaluation of Multiple-Output Boolean Functions in Embedded Software or Firmware

The paper addresses software and firmware implementation of multiple-output Boolean functions based on cascades of Look-Up Tables (LUTs). A LUT cascade is described as a means of compact representation of a large class of sparse Boolean functions, evaluation of which then reduces to multiple indirect memory accesses. The method is compared to a technique of direct PLA emulation and is illustrat...

متن کامل

A PC-Based Logic Simulator Using a Look-Up Table Cascade Emulator

This paper represents a cycle-based logic simulation method using an LUT cascade emulator, where an LUT cascade consists of multiple-output LUTs (cells) connected in series. The LUT cascade emulator is an architecture that emulates LUT cascades. It has a control part, a memory for logic, and registers. It connects the memory to registers through a programmable interconnection circuit, and evalu...

متن کامل

A Design Algorithm for Sequential Circuits Using LUT Rings

This paper shows a design method for a sequential circuit by using a Look-Up Table (LUT) ring. An LUT ring consists of memories, a programmable interconnection network, a feed-back register, an output register, and a control circuit. It sequentially emulates an LUT cascade that represents the state transition functions and the output functions. We present two algorithms for synthesizing a seque...

متن کامل

LUT Cascades and Emulators for Realization of Logic Functions

Two types of programmable logic devices using LUTs (Look-Up Tables) are presented. An LUT cascade directly implements logic functions by a series connection of LUTs, while an emulator emulates an LUT cascade by sequentially accessing LUTs. The LUT cascade is faster, but has a limited logic capability, while the emulator is slower, but has a higher logic capability. LUT cascades and emulators ca...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEICE Transactions

دوره 90-A  شماره 

صفحات  -

تاریخ انتشار 2007